Subtraction-Free Complexity, Cluster Transformations, and Spanning Trees
نویسندگان
چکیده
منابع مشابه
Subtraction-Free Complexity, Cluster Transformations, and Spanning Trees
Subtraction-free computational complexity is the version of arithmetic circuit complexity that allows only three operations: addition, multiplication, and division. We use cluster transformations to design efficient subtraction-free algorithms for computing Schur functions and their skew, double, and supersymmetric analogues, thereby generalizing earlier results by P. Koev. We develop such algo...
متن کاملMinimum Spanning Trees and Single Linkage Cluster Analysis
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Blackwell Publishing and Royal Statistical Society are col...
متن کاملOn the complexity of finding multi-constrained spanning trees
In this paper we present some new results concerning the classification of undirected spanning tree problems from the viewpoint of their computational complexity. Specifically, we study some problems asking for the existence in an undirected, unweighted graph, of a spanning tree satisfying one or several constraints. Thus we extend to the multi-constrained, unweighted case, the analysis that we...
متن کاملProgression Reconstruction from Unsynchronized Biological Data using Cluster Spanning Trees
Identifying the progression-order of an unsynchronized set of biological samples is crucial for comprehending the dynamics of the underlying molecular interactions. It is also valuable in many applied problems such as data denoising and synchronization, tumor classification and cell lineage identification. Current methods that attempt solving this problem are ultimately based either on polynomi...
متن کاملThe Complexity of Computing Graph-Approximating Spanning Trees
This paper deals with the problem of computing a spanning tree of a connected undirected graph G = (V,E) minimizing the sum of distance differences of all vertex pairs u, v ∈ V which are connected by an edge {u, v} ∈ E. We show that the decision variant of this optimization problem is NP-complete with respect to the Lp norm for arbitrary p ∈ N. For the reduction, we use the well known NP-comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computational Mathematics
سال: 2014
ISSN: 1615-3375,1615-3383
DOI: 10.1007/s10208-014-9231-y